Subcontracted Rational SFE

نویسنده

  • Matt Lepinski
چکیده

In their paper, “Rational Secure Computation and Ideal Mechanism Design,” Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, using physical envelopes and a ballot-box. We show that communication between the players is not essential to the ILM protocol. That is, we provide a protocol for rational secure function evaluation (Rational SFE) where the players just send a set of envelopes to a referee who simply performs a sequence of publicly verifiable actions. That is, the players can “subcontract” all of the computation to an untrusted referee. In addition to providing a communication structure that more closely matches the ideal game, our protocol also enables us to better simulate mediated games in which abort is not a dominated action.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Science and Artificial Intelligence Laboratory Subcontracted Rational SFE

In their paper, “Rational Secure Computation and Ideal Mechanism Design,” Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, using physical envelopes and a ballot-box. We show that communication between the players is not essential to the ILM protocol. That is, we provide a protocol for rational ...

متن کامل

The Makings of a Paradox: Unionization of Subcontracted Labor in Chilean Copper Industry

Latin American labor power has decreased dramatically in the 1990’s. In spite of this phenomenon, Chilean subcontracted laborers in the copper industry organized and forced the government to increase social protection for temporary workers. What circumstances allowed for the successful unionization? I argue that the unionization of subcontracted workers is due to a change in the labor instituti...

متن کامل

A Unified Characterization of Completeness and Triviality for Secure Function Evaluation

We present unified combinatorial characterizations of completeness for 2-party secure function evaluation (SFE) against passive and active corruptions in the information-theoretic setting, so that all known characterizations appear as special cases. In doing so we develop new technical concepts. We define several notions of isomorphism of SFE functionalities and define the “kernel” of an SFE fu...

متن کامل

Rate-Limited Secure Function Evaluation: Definitions and Constructions

We introduce the notion of rate-limited secure function evaluation (RL-SFE). Loosely speaking, in an RL-SFE protocol participants can monitor and limit the number of distinct inputs (i.e., rate) used by their counterparts in multiple executions of an SFE, in a private and verifiable manner. The need for RL-SFE naturally arises in a variety of scenarios: e.g., it enables service providers to “me...

متن کامل

Practical Secure Evaluation of Semi-private Functions

Two-party Secure Function Evaluation (SFE) is a very useful cryptographic tool which allows two parties to evaluate a function known to both parties on their private (secret) inputs. Some applications with sophisticated privacy needs require the function to be known only to one party and kept private (hidden) from the other one. However, existing solutions for SFE of private functions (PF-SFE) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005